A Family of Polynomials Related to Generic Degrees
نویسنده
چکیده
A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are described completely for classes that meet a parabolic subgroup whose components are of type A or are dihedral, and for the class of Coxeter elements.
منابع مشابه
Partial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملAn asymptotically tight bound on the number of connected components of realizable sign conditions
In this paper we prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of connected components of the realizations of all realizable sign conditions of a family of real polynomials. More precisely, we prove that the number of connected components of the realizations of all realizable sign conditions of ...
متن کاملAn asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign conditions of a family of real polynomials. More precisely, we prove that the number of semi-algebraically connected components of the realizations of all realiz...
متن کاملTopology of Generic Line Arrangements
Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial f = ∏ i(aix + biy + ci), so that A = (f = 0). We prove that the defining polynomials of two generic line arrangements are, up to a small deformation, topologically equivalent. In higher dimension the related result is that within a ...
متن کاملBernstein's polynomials for convex functions and related results
In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of Hermite-Hadamard inequality for convex functions.
متن کامل